Distributed Spatial Data Warehouse Indexed with Virtual Memory Aggregation Tree
نویسندگان
چکیده
In this paper we present a distributed spatial data warehouse system designed for storing and analyzing a wide range of spatial data. The data is generated by media meters working in a radio based measurement system. The distributed system is based on a new model called the cascaded star model. In order to provide satisfactory interactivity for our system, we used distributed computing supported by a special indexing structure called an aggregation tree. We provide a detailed description of distributed system components and their co-operation. The indexing structure operation is tightly integrated with the spatial character of the data and the data model. Thanks to a memory managing mechanism the system is very flexible in the field of aggregates accuracy. A final selective materialization of indexing structure fragments strongly increases the system’s efficiency. Basing on the tests results, we compare the efficiencies of the distributed and a singlemachine systems, and demonstrate the importance of indexing structure materialization.
منابع مشابه
Revised Aggregation-tree Used in Metadata Extraction from SVG Images
Many of the multimedia researchers have focused on the issue of the retrieval of images using indexed image collections. A number of spatial data structures based on Minimum Bounding Rectangles (MBRs) have been developed. Previously, we presented aggregation-tree structure to extract metadata from Scalable Vector Graphics (SVG) documents [8]. In this paper, we revised the aggregation-tree to be...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملA High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure
The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...
متن کاملQuery Management in Data Warehouse Using Virtual Machine Fault Tolerant Resource Scheduling Algorithm
Multi-stage processing occurred in distributed data warehouse. Many joints and splits are required at the time of submitting queries. Scheduling algorithms are used to resolve these issues. Reducing the processing time and cost are common concerns in scheduling. By this way the available resources are used to accomplish the task with quick manner. In this paper, we propose Virtual Machine Fault...
متن کاملManaging Gigabyte Virtual Environment Walkthrough
In this paper, we study the problem of interactive walkthrough of a large virtual environment (VE) where the data representing 3D virtual objects can not reside completely in the main memory. We tap into the wealth of techniques (indexing, caching, prefetching) that have been widely used by the database community, and investigate how walkthrough semantics can be integrated into these techniques...
متن کامل